概率语言多属性群决策方法及其在新型智慧城市市民获得感评价中的应用

针对公众参与的语言信息多属性群决策问题，研究了考虑参与者满意度的概率语言多属性群决策方法。首先，根据参与者的语言评价信息确定并规范化概率语言决策矩阵。然后，对大群体进行共识分析，由最大化参与者群体的满意度构建线性规划模型，确定参与者群组的权重；构造正、负理想方案的评价向量，构建多目标规划模型，用拉格朗日乘子法求解属性权重；定义各方案的加权贴近度，并以此对方案进行排序和优选。最后，通过新型智慧城市市民获得感评价案例验证了模型的可行性和有效性。     

Advantage of Quantum Theory over Nonclassical Models of Communication

Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However, a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra-quantum correlations in “space-like” and/or “time-like” paradigms. In this letter, a communication task involving three spatially separated parties is proposed where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. This task is called authentication with limited communication, the restrictions on communication being: i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several nonclassical theories although they might possess stronger “space-like” and/or “time-like” correlations. Surprisingly, quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other nonclassical strategies.     

Expected reliability of communication protocols

We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods $r$ with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from $s$ reaches $r$ when the edges of the network fail independently with probability $1?p$.We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when $p$ is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of $p$. In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain.     

一类改进最大熵方法的可调参数分析

在结构可靠性分析中,引入含可调参数的转换函数能对传统的最大熵方法进行改进,获得更高的失效概率预测精度。但是,此可调参数的最佳取值很难确定。针对这一问题,引入概率守恒方程,从功能函数转换前后所得概率密度函数出发,建立其最大熵值的变化关系,给出转换前后最大熵值之差的理论形式。通过对三种典型单调非线性转换函数开展算例研究,发现功能函数转换前后的最大熵值之差与转换函数的最佳可调参数值有关。改变可调参数值驱使最大熵值之差变化的同时,改进最大熵方法能遍历到更好的失效概率估计值。     

Stochastic modeling of quality of systems operating in a heterogeneous environment

We consider systems that are subject to an external mixed Poisson shock process. Each shock can result in a failure of a system with a given probability and is survived with the complementary probability. Each shock additionally decreases the quality function that describes the performance of a system, thus forming the corresponding stochastic process. Expectations (unconditional and conditional on survival) and relevant variability characteristics for the stochastic quality function are derived. Some monotonicity properties of the conditional quality function are investigated and the future values of this function are derived.     

The size Ramsey number of short subdivisions of bounded degree graphs

For graphs G and F, write if any coloring of the edges of G with colors yields a monochromatic copy of the graph F. Suppose is obtained from a graph S with s vertices and maximum degree d by subdividing its edges h times (that is, by replacing the edges of S by paths of length h + 1). We prove that there exists a graph G with no more than edges for which holds, provided that . We also extend this result to the case in which Q is a graph with maximum degree d on q vertices with the property that every pair of vertices of degree greater than 2 are distance at least h + 1 apart. This complements work of Pak regarding the size Ramsey number of “long subdivisions” of bounded degree graphs.     

An interview with Sam C. Saunders

Sam C. Saunders, the son of Elizabeth Cundiff and Winston E. Saunders, was born in Richland, OR, on February 24, 1931. The family moved to La Grande, OR, in 1944, where Sam completed high school and two years at Eastern Oregon College. He then received the BSc degree in Mathematics from the University of Oregon, Eugene, OR, in 1952, and he attended the University of Washington, Seattle, WA, receiving a PhD degree under Z. W. Birnbaum. After graduating, he accepted employment at the Boeing Company in its Mathematical Services Unit and, in 1972, a position as a Full Professor at Washington State University, Pullman, WA, from which he retired in 1996.     

Computational analysis for the determination of deleterious nsSNPs in human MTHFD1 gene

Single nucleotide polymorphisms (SNPs) are the most common genetic polymorphisms and play a major role in many inherited diseases. Methylenetetrahydrofolate dehydrogenase 1 (MTHFD1) is one of the enzymes involved in folate metabolism. In the present study, the functional and structural consequences of nsSNPs of human MTHFD1 gene was analyzed using various computational tools like SIFT, PolyPhen2, PANTHER, PROVEAN, SNAP2, nsSNPAnalyzer, PhD-SNP, SNPs&GO, I-Mutant, MuPro, ConSurf, InterPro, NCBI Conserved Domain Search tool, ModPred, SPARKS-X, RAMPAGE, FT Site and PyMol. Out of 327 nsSNPs form human MTHFD1 gene, total 45 SNPs were predicted as functionally most significant SNPs, among which 17 were highly conserved and functional, 17 were highly conserved and structural residues. Among 45 most significant SNPs, 15 were predicted to be involved in post translational modifications. The p.Gly165Arg may interfere in homodimer interface formation. The p.Asn439Lys and p.Asp445Asn may interfere in binding interactions of MTHFD1 protein with cesium cation and potassium. The two SNPs (p.Asp562Gly and p.Gly637Cys) might interfere in interactions of MTHFD1 with ligand.